Scheduling Job Placement Interviews at a University
نویسنده
چکیده
We describe experience with a job interview scheduling system that has been in use since 2001 at the University of Chicago Graduate School of Business(UCGSB). During interview season, a typical week has 300 job-seekers requesting 1000 interviews from 100 interviewing companies, to be scheduled into 1200 timeslots. We match job-seekers with companies with time slots so that we maximize the number of desired interviews scheduled, no job-seeker has two interviews scheduled at the same time, no interviewer has two interviews scheduled for the same time, and no interview is scheduled for a job-seeker during an interval which he has designated as unavailable. One complication is that each company specifies(in advance) its interview length, ranging from 30 to 120 minutes. For example, a 30 minute interview slot with Company X may conflict with two 45 minute slots with Company Y that overlap with it. The interview scheduling system is part of a larger job interview bidding system. We examine some of the complications of directly combining the interview assignment part with the auction part.
منابع مشابه
Scheduling Interviews for a Job Fair
We describe the design and use of a program to schedule job interviews for law firms and students at a job fair. It has been used to manage the Southeastern Public Interest Job Fair for the last five years. The program uses a new scheduling algorithm that produces particularly convenient
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملA New Approach in Job Shop Scheduling: Overlapping Operation
In this paper, a new approach to overlapping operations in job shop scheduling is presented. In many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. In each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...
متن کاملCritical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004